Claw-free graphs. IV. Decomposition theorem
نویسندگان
چکیده
A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series of papers we give a structural description of all claw-free graphs. In this paper, we achieve a major part of that goal; we prove that every claw-free graph either belongs to one of a few basic classes, or admits a decomposition in a useful way.
منابع مشابه
Claw-free graphs. V. Global structure
A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier papers of this series we proved that every claw-free graph either belongs to one of several basic classes that we described explicitly, or admits one of a few kinds of decomposition. In this paper we convert this “decomposition” theorem into a theorem describing the global structure of claw-free graphs.
متن کاملAn algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem
We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphsthat runs in O(n)−time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also introduced in the present paper. Despite being weaker than the well-known structure result for claw-free graphs given...
متن کاملAn algorithmic decomposition of claw-free graphs leading to an O(n)-algorithm for the weighted stable set problem
We propose an algorithm for solving the maximumweighted stable set problem on claw-free graphsthat runs in O(n3)−time, drastically improving theprevious best known complexity bound. This algo-rithm is based on a novel decomposition theoremfor claw-free graphs, which is also introduced in thepresent paper. Despite being weaker than the wellknown structure result for claw-...
متن کاملThe Structure of Claw-Free Perfect Graphs
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs. In 1999, Maffray and Reed [6] successfully described how elementary graphs can be built using line-graphs of bipartite graphs using local augmentation. How...
متن کاملDisconnected Cuts in Claw-free Graphs
A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several homomorphism and contraction problems, and fits in an extensive line of research on vertex cuts with additional properties. It is known that Disconnected Cut is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 98 شماره
صفحات -
تاریخ انتشار 2008